Browsing by Subject "Mixed strategies"

Now showing items 1-6 of 6

    • Article  

      Candidate quality in a Downsian model with a continuous policy space 

      Xefteris, Dimitrios; Aragonés, Enriqueta (2012)
      This paper characterizes a unique mixed strategy Nash equilibrium in a one-dimensional Downsian model of two-candidate elections with a continuous policy space, where candidates are office motivated and one candidate enjoys ...
    • Article  

      Equilibria in unidirectional spatial models 

      Xefteris, Dimitrios (2013)
      This paper (a) characterizes the unique Nash equilibrium of the unidirectional Hotelling-Downs game in which firms maximize their market shares, for any distribution of the consumers, and (b) analyzes equilibrium behavior ...
    • Article  

      Mixed equilibria in runoffelections 

      Xefteris, Dimitrios (2014)
      We demonstrate that the Hotelling-Downs model with runoffvoting always admits symmetric mixed strategy equilibria for any (even or odd) number of office-motivated candidates (provided they are at least four). In specific, ...
    • Article  

      Mixed strategy equilibrium in a Downsian model with a favored candidate: A comment 

      Xefteris, Dimitrios (2012)
      This note complements Aragonès and Palfrey (2002) [2] by providing upper and lower bounds of the equilibrium payoff of the advantaged (disadvantaged) candidate for any symmetric distribution of the median voter's ideal ...
    • Article  

      Nash equilibria in discrete routing games with convex latency functions 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant ...
    • Article  

      A new model for selfish routing 

      Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In this work, we introduce and study a new, potentially rich model for selfish routing over non-cooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...